Type Inference for Action Semantics

نویسندگان

  • Susan Even
  • David A. Schmidt
چکیده

Type inference for action semantics " (1990). Retrospective Theses and Dissertations. Paper 9492. The most advanced technology has been used to photograph and reproduce this manuscript from the microfilm master. UMI films the text directly from the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be from any type of computer printer. The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion. Oversize materials (e.g., maps, drawings, charts) are reproduced by sectioning the original, beginning at the upper left-hand corner and continuing from left to right in equal sections with small overlaps. Each original is also photographed in one exposure and is included in reduced form at the back of the book. Photographs included in the original manuscript have been reproduced xerographically in this copy. Higher quality 6" x 9" black and white photographic prints are available for any photographs or illustrations appearing in this copy for an additional charge. Contact UMI directly to order.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proceedings of the First International Workshop on ACTION SEMANTICS 14 April 1994 , Edinburgh , Scotland

A distinguishing characteristic of action semantics is its facet system, which defines the variety of information flows in a language definition. The facet system can be analyzed to validate the well-formedness of a language definition, to infer the typings of its inputs and outputs, and to calculate the operational semantics of programs. We present a single framework for doing all of the above...

متن کامل

Taming E ects with MonadicTyping 1 Richard

The familiar Hindley-Milner type system of the ML language family is extended with monad annotations to account for possible side eeects of expression evaluation. This also allows eeects to be eeectively encapsulated by lexical scopes, with enforcement provided by type checking. A type-and-eeects analysis supports type inference. Type soundness and completeness theorems establish the coherence ...

متن کامل

Typing with Conditions and Guarantees in LFPL

LFPL is a functional language for non-size increasing computation with an operational semantics that allows in-place update. The semantics is correct for all well-typed programs thanks to linear restrictions on the typing. Nevertheless, the linear typing is very strict and rejects many correct, natural in-place update algorithms. We investigate a general approach to easing the tight linear rest...

متن کامل

Mémoire D’habilitation À Diriger Des Recherches

interpretation is a very general theory of the approximation of program semantics, introduced by Patrick Cousot and Radhia Cousot in the late 70s [CC77]. It stems from the observation that, while there exists a wide variety of program semantics, they can be uniformly described as fixpoints of operators in partially ordered structures. This observation extends to the formal methods used to ensur...

متن کامل

Dynamic Causal Calculus

We introduce dynamic causal calculus, a nonmonotonic formalism that can be viewed as a direct logical counterpart of the action description language C+ from (Giunchiglia et al. 2004). We formulate a nonmonotonic semantics of the associated causal language, and compare this semantics with the indirect, two-stage semantics for C+, given in (Giunchiglia et al. 2004). It will be shown, in particula...

متن کامل

Workflow Inference: What to Do with One Example and No Semantics

It is much easier to get human experts to provide example action sequences than declarative representations of either the semantics of the atomic actions in the sequences or the workflow used to generate the sequences. To address this particular instance of the knowledge acquisition bottleneck, this paper describes an algorithm called Workflow Inference from Traces (WIT) that learns workflows f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990